The main objective of the paper is to improve the Round Robin (RR) algorithmusing dynamic ITS by coalescing it with Shortest Remaining Time Next (SRTN)algorithm thus reducing the average waiting time, average turnaround time andthe number of context switches. The original time slice has been calculated foreach process based on its burst time.This is mostly suited for soft real timesystems where meeting of deadlines is desirable to increase its performance.The advantage is that processes that are closer to their remaining completiontime will get more chances to execute and leave the ready queue. This willreduce the number of processes in the ready queue by knocking out short jobsrelatively faster in a hope to reduce the average waiting time, turn aroundtime and number of context switches. This paper improves the algorithm [8] andthe experimental analysis shows that the proposed algorithm performs betterthan algorithm [6] and [8] when the processes are having an increasing order,decreasing order and random order of burst time.
展开▼
